On pseudoknot-bordered words and their properties
نویسندگان
چکیده
منابع مشابه
On pseudoknot-bordered words and their properties
a r t i c l e i n f o a b s t r a c t We study a generalization of the classical notions of bordered and unbordered words, motivated by biomolecular computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in biomolecular computing to encode information. Due to the fact that A is Watson–Crick complementary to T and G to C, DNA single strands that are W...
متن کاملOn pseudoknot words and their properties ?
We study a generalization of the classical notions of bordered and unbordered words, motivated by biomolecular computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in biomolecular computing to encode information. Due to the fact that A is Watson-Crick (WK) complementary to T and G to C, DNA single strands that are WK complementary can bind to each ...
متن کاملWatson-Crick Bordered Words and their Syntactic Monoid
DNA strands that, mathematically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways. One of the structures that is usually undesirable f...
متن کاملInvolutively Bordered Words
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each...
متن کاملPseudo-Identities and Bordered Words
This paper investigates the notions of θ-bordered words and θ-unbordered words for various pseudo-identity functions θ. A θ-bordered word is a non-empty word u such that there exists a word v which is a prefix of u while θ(v) is a suffix of u. The case where θ is the identity function corresponds to the classical notions of bordered and unbordered words. Here we explore cases where θ is a pseud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2009
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2008.08.002